Coherent configurations
ثبت نشده
چکیده
In Section 2, after giving the basic definitions and some elementary consequences, we introduce two fundamental algebraic structures associated with a coherent configuration, namely, the boolean algebra of admissable relations and the adjacency ring. The action of a group on a finite set induces the structure of a coherent configuration in the set, and in this situations, which we refer to as the group case, the admissable relations are the invariant binary relations in the sense of Wielandt [20] and the adjacency ring is the centralizer ring of the permutation representation. Thus coherent configurations provide a combinatorial setting for centralizer ring theory of permutation representations on the one hand, and the possibility of applying methods of centralizer ring theory to combinatorics on the other. In practice, such processes as fusion (see Section 10) may produce coherent configurations
منابع مشابه
Coherent configurations, association schemes and permutation groups
Coherent configurations are combinatorial objects invented for the purpose of studying finite permutation groups; every permutation group which is not doubly transitive preserves a non-trivial coherent configuration. However, symmetric coherent configurations have a much longer history, having been used in statistics under the name of association schemes. The relationship between permutation gr...
متن کاملFast matrix multiplication using coherent configurations
We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on the s-rank of the matrix multiplication tensor imply upper bounds on the ordinary rank. In particular, if the “s-rank exponent of matrix multiplication” equals 2, then ω = 2. This connection between the s-rank exponent and the ordinary exponent enables us to significantly generalize the group-th...
متن کاملA study of permutation groups and coherent configurations
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii CHAPTER 1. HISTORICAL BACKGROUND . . . . . . . . . . . . . . . . . 1 1.1 Early Historical Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Resolvent Polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 More Recent Developments . . . . . . . . . . . . . . . . . ....
متن کاملThe Absolute Bound for Coherent Configurations
In this paper we generalize the absolute bound for association schemes to coherent configurations. We examine this bound in the context of quasi-symmetric and strongly regular designs. In particular, we use it to derive a new feasibility condition for strongly regular designs and give examples of parameter sets ruled out by this condition but which pass all other feasibility conditions known to...
متن کاملTightness in subset bounds for coherent configurations
Association schemes have many applications to the study of designs, codes and geometries, and are well-studied. Coherent configurations are a natural generalization of association schemes, however, analogous applications have yet to be fully explored. Recently, Hobart [Michigan Math. J. 58 (2009), 231–239] generalized the linear programming bound for association schemes, showing that a subset Y...
متن کامل